On-Supporting Energy Balanced $k$ -Barrier Coverage in Wireless Sensor Networks
نویسندگان
چکیده
منابع مشابه
An Energy Efficient Barrier Coverage Algorithm for Wireless Sensor Networks
Intrusion detection is one of the most important applications of wireless sensor networks.Whenmobile objects are entering into the boundary of a sensor field or are moving cross the sensor field, they should be detected by the scattered sensor nodes before they pierce through the field of sensor (barrier coverage). In this paper, we propose an energy efficient scheduling method based on learnin...
متن کاملOn balanced k-coverage in visual sensor networks
Given a set of directional visual sensors, the kcoverage problem determines the orientation of minimal directional sensors so that each target is covered at least k times. As the problem is NP-complete, a number of heuristics have been devised to tackle the issue. However, the existing heuristics provide imbalance coverage of the targets–some targets are covered k times while others are left to...
متن کاملIntrusion K-Coverage in Wireless Sensor Networks
One of the main applications of Wireless Sensor Networks is surveillance and monitoring. Providing and maintaining the required coverage over the area of an intrusion (or other events of our choice) is of great importance. The network should be able to provide different levels of coverage based on application needs and reconfigure itself while ensuring energy efficiency. In this paper we presen...
متن کاملExpected k-coverage in wireless sensor networks
We are concerned with wireless sensor networks where n sensors are independently and uniformly distributed at random in a finite plane. Events that are within a fixed distance from some sensor are assumed to be detectable and the sensor is said to cover that point. In this paper, we have formulated an exact mathematical expression for the expected area that can be covered by at least k out of n...
متن کاملImproving Energy-Efficient Target Coverage in Visual Sensor Networks
Target coverage is one of the important problems in visual sensor networks. The coverage should be accompanied with an efficient use of energy in order to increase the network lifetime. In this paper, we address the maximum lifetime for visual sensor networks (MLV) problem by maximizing the network lifetime while covering all the targets. For this purpose, we develop a simulated annealing (SA) ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2018
ISSN: 2169-3536
DOI: 10.1109/access.2018.2792678